Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
271	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Counting Triangulations Approximately Victor Alvarez∗ Karl Bringmann† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Analysis of algorithms Triangulation Computational complexity theory Time complexity Algorithm Randomized algorithm Big O notation Delaunay triangulation Planar separator theorem Theoretical computer science Mathematics Applied mathematics
272	Introduction to Computing: Explorations in Language, Logic, and Machines Add to Reading List Source URL: www.computingbook.org Language: English - Date: 2011-08-19 11:52:42 Theoretical computer science Insertion sort B-tree Algorithm Time complexity Recursion Radix sort Selection algorithm Mathematics Sorting algorithms Order theory
273	CS 373 Final Exam (December 15, 2000) Fall 2000 Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:48:10 Complexity classes NP-complete problems Mathematical optimization NP-hard Time complexity NP Independent set P versus NP problem Clique Theoretical computer science Computational complexity theory Applied mathematics
274	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models Binay K. Bhattacharya∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-24 09:52:12 Binary trees Analysis of algorithms Computational complexity theory Time complexity Dynamic programming Interval graph Tree decomposition Rope Interval tree Graph theory Theoretical computer science Mathematics
275	Gossiping in a Multi-Channel Radio Network An Oblivious Approach to Coping with Malicious Interference (Extended Abstract) Shlomi Dolev1 , Seth Gilbert2 , Rachid Guerraoui3 , and Calvin Newport4 1 Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2007-09-28 06:21:17 Analysis of algorithms NP-complete problems Adversary model Gossip protocol Clique Time complexity Algorithm Theoretical computer science Applied mathematics Computational complexity theory
276	The min-# problem, a hybrid error criterion for near-linear time performance Lilian Buzer∗† Abstract 2.1 Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:46 Network theory Shortest path problem NP-complete problems Connectivity Euclidean plane geometry Analysis of algorithms Path decomposition Minimum spanning tree Theoretical computer science Computational complexity theory Mathematics
277	PowerTHERM BENEFITS Accurate results Handles highly detailed geometric complexity Short turn-around time Add to Reading List Source URL: www.exa.com Language: English - Date: 2011-11-17 16:01:28 Chemical engineering Heat conduction Passive fire protection Thermodynamics Physical quantities Thermal management of electronic devices and systems Convection Thermal conduction Thermal radiation Heat transfer Physics Mechanical engineering
278	Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:47 Analysis of algorithms Computational complexity theory Distributed computing Leader election Time complexity Distributed data storage Consensus Chang and Roberts algorithm Theoretical computer science Distributed algorithms Applied mathematics
279	Journal of Computer and System Sciences–737 Contents lists available at ScienceDirect Journal of Computer and System Sciences www.elsevier.com/locate/jcss Add to Reading List Source URL: math.mit.edu Language: English - Date: 2011-03-23 10:26:18 Applied mathematics Natural proof Pseudorandom generator Entailment Time complexity Circuit complexity Arithmetic function Holomorphic functional calculus Theoretical computer science Computational complexity theory Logic
280	Distributed Computing FS 2011 Prof. R. Wattenhofer Barbara Keller Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:47 Spanning tree Fault-tolerant computer systems Analysis of algorithms Self-stabilization Minimum spanning tree Algorithm Time complexity Bellman–Ford algorithm Distributed computing Theoretical computer science Computational complexity theory Mathematics

UPDATE